Rescheduling Production on Identical Parallel Machines upon new jobs arrivals
نویسندگان
چکیده
منابع مشابه
Online scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
متن کاملScheduling equal-length jobs on identical parallel machines
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions fi of the completion time Ci of each job Ji, the problem can be solved in polynomial time for any fixed value of m. The only restriction is that functions fi have to be...
متن کاملScheduling jobs within time windows on identical parallel machines: New model and algorithms
This article analyses the problem of scheduling non-preemptive jobs processed within time windows on k identical parallel machines. Each job can be completed on a sub-set of machines. The problem of determining if a particular set of jobs can be completed by the available machines is NP-complete. A new model and heuristics are proposed to solve this problem in two particular cases: first, the c...
متن کاملFlowshop scheduling with identical jobs and uniform parallel machines
The single-stage scheduling problem to minimize the makespan of identical jobs on uniform parallel machines is known to be solvable in polynomial-time. We extend this work to consider multi-stage systems with flowshop configuration. We show that the 2-stage problem may also be solved in polynomial-time and for the number of stages greater than two, the problem is shown to be NP-hard. We present...
متن کاملA new algorithm for minimizing makespan on identical parallel machines
A heuristic algorithm is developed for the classical multiprocessor scheduling problem in which independent jobs are nonpreemptively scheduled on identical parallel machines with the objective of minimizing the makespan. The algorithm uses iteratively the LPT procedure followed by the MultiFit procedure on different job and machine sets. The effectiveness of our algorithm is evaluated through c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.586